A Tool for Integer Homology Computation: Lambda-At Model

In this paper, we formalize the notion of lambda-AT-model (where $\lambda$ is a non-null integer) for a given chain complex, which allows the computation of homological information in the integer domain avoiding using the Smith Normal Form of the boundary matrices. We present an algorithm for computing such a model, obtaining Betti numbers, the prime numbers p involved in the invariant factors of the torsion subgroup of homology, the amount of invariant factors that are a power of p and a set of representative cycles of generators of homology mod p, for each p. Moreover, we establish the minimum valid lambda for such a construction, what cuts down the computational costs related to the torsion subgroup. The tools described here are useful to determine topological information of nD structured objects such as simplicial, cubical or simploidal complexes and are applicable to extract such an information from digital pictures.Comment: Journal Image and Vision Computing, Volume 27 Issue 7, June, 200

Detectors and Concepts for sub-100 ps timing with gaseous detectors

We give a short compendium of the main ongoing detectors and concepts capable of performing accurate sub-100 ps timing at high particle fluxes and on large areas, through technologies based on gaseous media. We briefly discuss the state-of-the-art, technological limitations and prospects, and a new bizarre idea

Cup products on polyhedral approximations of 3D digital images

Let I be a 3D digital image, and let Q(I) be the associated cubical complex. In this paper we show how to simplify the combinatorial structure of Q(I) and obtain a homeomorphic cellular complex P(I) with fewer cells. We introduce formulas for a diagonal approximation on a general polygon and use it to compute cup products on the cohomology H *(P(I)). The cup product encodes important geometrical information not captured by the cohomology groups. Consequently, the ring structure of H *(P(I)) is a finer topological invariant. The algorithm proposed here can be applied to compute cup products on any polyhedral approximation of an object embedded in 3-space

One More Step Towards Well-Composedness of Cell Complexes over nD Pictures

An nD pure regular cell complex K is weakly well-composed (wWC) if, for each vertex v of K, the set of n-cells incident to v is face-connected. In previous work we proved that if an nD picture I is digitally well composed (DWC) then the cubical complex Q(I) associated to I is wWC. If I is not DWC, we proposed a combinatorial algorithm to “locally repair” Q(I) obtaining an nD pure simplicial complex PS(I) homotopy equivalent to Q(I) which is always wWC. In this paper we give a combinatorial procedure to compute a simplicial complex PS(¯I) which decomposes the complement space of |PS(I)| and prove that PS(¯I) is also wWC. This paper means one more step on the way to our ultimate goal: to prove that the nD repaired complex is continuously well-composed (CWC), that is, the boundary of its continuous analog is an (n − 1)- manifold.Ministerio de Economía y Competitividad MTM2015-67072-

Using membrane computing for obtaining homology groups of binary 2D digital images

Membrane Computing is a new paradigm inspired from cellular communication. Until now, P systems have been used in research areas like modeling chemical process, several ecosystems, etc. In this paper, we apply P systems to Computational Topology within the context of the Digital Image. We work with a variant of P systems called tissue-like P systems to calculate in a general maximally parallel manner the homology groups of 2D images. In fact, homology computation for binary pixel-based 2D digital images can be reduced to connected component labeling of white and black regions. Finally, we use a software called Tissue Simulator to show with some examples how these systems wor

Connectivity forests for homological analysis of digital volumes

In this paper, we provide a graph-based representation of the homology (information related to the different “holes” the object has) of a binary digital volume. We analyze the digital volume AT-model representation [8] from this point of view and the cellular version of the AT-model [5] is precisely described here as three forests (connectivity forests), from which, for instance, we can straightforwardly determine representative curves of “tunnels” and “holes”, classify cycles in the complex, computing higher (co)homology operations,... Depending of the order in which we gradually construct these trees, tools so important in Computer Vision and Digital Image Processing as Reeb graphs and topological skeletons appear as results of pruning these graphs

Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology

In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend the persistence computation to a wider setting. Finally, we show how to combine incremental and decremental techniques for persistent homology computation

Basis-independent partial matchings induced by morphisms between persistence modules

In this paper, we study how basis-independent partial matchings induced by morphisms between persistence modules (also called ladder modules) can be defined. Besides, we extend the notion of basis-independent partial matchings to the situation of a pair of morphisms with same target persistence module. The relation with the state-of-the-art methods is also given. Apart form the basis-independent property, another important property that makes our partial matchings different to the state-of-the-art ones is their linearity with respect to ladder modules